FPT approximation schemes for maximizing submodular functions
نویسندگان
چکیده
منابع مشابه
FPT Approximation Schemes for Maximizing Submodular Functions
We investigate the existence of approximation algorithms for maximization of submodular functions, that run in fixed parameter tractable (FPT) time. Given a non-decreasing submodular set function v : 2 → R the goal is to select a subset S of K elements from X such that v(S) is maximized. We identify three properties of set functions, referred to as p-separability properties, and we argue that m...
متن کاملMaximizing Stochastic Monotone Submodular Functions
We study the problem of maximizing a stochastic monotone submodular function with respect to a matroid constraint. Our model can capture the effect of uncertainty in different problems, such as cascade effects in social networks, capital budgeting, sensor placement, etc. We study the adaptivity gap the ratio between the values of optimal adaptive and non-adaptive policies and show that it is eq...
متن کاملFast algorithms for maximizing submodular functions
There has been much progress recently on improved approximations for problems involving submodular objective functions, and many interesting techniques have been developed. However, the resulting algorithms are often slow and impractical. In this paper we develop algorithms that match the best known approximation guarantees, but with significantly improved running times, for maximizing a monoto...
متن کاملA Deterministic Algorithm for Maximizing Submodular Functions
The problem of maximizing a non-negative submodular function was introduced by Feige, Mirrokni, and Vondrak [FOCS’07] who provided a deterministic local-search based algorithm that guarantees an approximation ratio of 1 3 , as well as a randomized 2 5 -approximation algorithm. An extensive line of research followed and various algorithms with improving approximation ratios were developed, all o...
متن کاملAn Online Algorithm for Maximizing Submodular Functions
We consider the following two problems. We are given as input a set of activities and a set of jobs to complete. Our goal is to devise a schedule for allocating time to the various activities so as to achieve one of two objectives: minimizing the average time required to complete each job, or maximizing the number of jobs completed within a fixed time T . Formally, a schedule is a sequence 〈(v1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2017.10.002